L∞ Voronoi Diagrams and Applications to VLSI Layout and Manufacturing
نویسنده
چکیده
In this paper we address the L∞ Voronoi diagram of polygonal objects and present applications in VLSI layout and manufacturing. We show that in L∞ the Voronoi diagram of segments consists only of straight line segments and is thus much simpler to compute than its Euclidean counterpart. Moreover, it has a natural interpretation. In applications where Euclidean precision is not particularly important the L∞ Voronoi diagram can provide a better alternative. Using the L∞ Voronoi diagram of polygons we address the problem of calculating the critical area for shorts in a VLSI layout. The critical area computation is the main computational problem in VLSI yield prediction.
منابع مشابه
Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction
We address the problem of computing critical area for open faults in a circuit layout in the presence of multilayer loops and redundant interconnects. The extraction of critical area is a fundamental problem in VLSI yield prediction. We first model the problem as a graph problem and then we solve it efficiently by exploiting its geometric nature. We introduce the open-fault Voronoi diagram of p...
متن کاملNet-aware Critical Area extraction for VLSI opens via Voronoi diagrams
We address the problem of computing critical area for opens in a circuit layout in the presence of loops and redundant interconnects. The extraction of critical area is the main computational problem in VLSI yield prediction for random manufacturing defects. Our approach first models the problem as a graph problem and solves it efficiently by exploiting its geometric nature. The approach expand...
متن کاملThe hausdorff voronoi diagram of polygonal objects: a divide and conquer approach
We study the Hausdorff Voronoi diagram of a set S of polygonal objects in the plane, a generalization of Voronoi diagrams based on the maximum distance of a point from a polygon, and show that it is equivalent to the Voronoi diagram of S under the Hausdorff distance function. We investigate the structural and combinatorial properties of the Hausdorff Voronoi diagram and give a divide and conque...
متن کاملThe Higher Order Hausdorff Voronoi Diagram and Vlsi Critical Area Extraction for Via-blocks
We extend the Voronoi diagram framework to compute the critical area of a circuit layout [15, 12, 16, 13, 14] with the ability to accurately compute critical area for via-blocks on via and contact layers in the presence of multilayer loops, redundant vias, and redundant interconnects. Critical area is a measure reflecting the sensitivity of a VLSI design to random defects during IC manufacturin...
متن کاملRandomized incremental construction of the Hausdorff Voronoi diagram of non-crossing clusters
The Hausdorff Voronoi diagram of a set of clusters of points in the plane is a generalization of the classic Voronoi diagram, where distance between a point t and a cluster P is measured as the maximum distance, or equivalently the Hausdorff distance between t and P . The size of the diagram for non-crossing clusters is O(n ), where n is the total number of points in all clusters. In this paper...
متن کامل